Symmetric Permutations Avoiding Two Patterns ∗
نویسنده
چکیده
Symmetric pattern-avoiding permutations are restricted permutations which are invariant under actions of certain subgroups of D4, the symmetry group of a square. We examine pattern-avoiding permutations with 180◦ rotational-symmetry. In particular, we use combinatorial techniques to enumerate symmetric permutations which avoid one pattern of length three and one pattern of length four. Our results involve well-known sequences such as the alternating Fibonacci numbers, Catalan numbers, triangular numbers, and powers of two.
منابع مشابه
The Weak Order on Pattern-avoiding Permutations
The weak order on the symmetric group is a well-known partial order which is also a lattice. We consider subposets of the weak order consisting of permutations avoiding a single pattern, characterizing the patterns for which the subposet is a lattice. These patterns have only a single small ascent or descent. We prove that all patterns for which the subposet is a sublattice have length at most ...
متن کاملRestricted Symmetric Permutations∗
Pattern-avoiding involutions, which have received much enumerative attention, are patternavoiding permutations which are invariant under the natural action of a certain subgroup of D8, the symmetry group of a square. Three other nontrivial subgroups of D8 also have invariant permutations under this action. For each of these subgroups, we enumerate the set of permutations which are invariant und...
متن کاملPattern Avoidance in Coloured Permutations
Let Sn be the symmetric group, Cr the cyclic group of order r, and let S (r) n be the wreath product of Sn and Cr; which is the set of all coloured permutations on the symbols 1, 2, . . . , n with colours 1, 2, . . . , r, which is the analogous of the symmetric group when r = 1, and the hyperoctahedral group when r = 2. We prove, for every 2letter coloured pattern φ ∈ S 2 , that the number of φ...
متن کاملNew Equivalences for Pattern Avoiding Involutions
We complete the Wilf classification of signed patterns of length 5 for both signed permutations and signed involutions. New general equivalences of patterns are given which prove Jaggard’s conjectures concerning involutions in the symmetric group avoiding certain patterns of length 5 and 6. In this way, we also complete the Wilf classification of S5, S6, and S7 for involutions.
متن کاملNew Equivalences for Pattern Avoidance for Involutions
We complete the Wilf classification of signed patterns of length 5 for both signed permutations and signed involutions. New general equivalences of patterns are given which prove Jaggard’s conjectures concerning involutions in the symmetric group avoiding certain patterns of length 5 and 6. In this way, we also complete the Wilf classification of S5, S6, and S7 for both permutations and involut...
متن کامل